This paper presents an abstract study of completeness properties of non-classical logics with respect to matricial semantics. Given a class of reduced matrix models we define three completeness properties of increasing strength and characterize them in several useful ways. Some of these characterizations hold in absolute generality and others are for logics with generalized implication or disjunction connectives, as considered in the previous papers. Finally, we consider completeness with respect to matrices with a linear dense order and characterize it in (...) terms of an extension property and a syntactical metarule. This is the final part of the investigation started and developed in the papers :417–446, 2010; Arch Math Logic 53:353–372, 2016). (shrink)

Logical implications are closely related to modal operators. Lattice-valued logic LL and quantum logic QL were formulated in Titani S (1999) Lattice Valued Set Theory. Arch Math Logic 38:395–421, Titani S (2009) A Completeness Theorem of Quantum Set Theory. In: Engesser K, Gabbay DM, Lehmann D (eds) Handbook of Quantum Logic and Quantum Structures: Quantum Logic. Elsevier Science Ltd., pp. 661–702, by introducing the basic implication → which represents the lattice order. In this (...) paper, we fomulate a predicate orthologic provided with the basic implication, which corresponds to complete ortholattices, and then formulate a quantum logic which is equivalent to QL, by using a modal operator instead of the basic implication. (shrink)

We introduce the simpler and shorter proof of Hajek’s theorem that the mathematical induction on ω implies a contradiction in the set theory with the comprehension principle within Łukasiewicz predicate logic Ł ${\forall}$ (Hajek Arch Math Logic 44(6):763–782, 2005) by extending the proof in (Yatabe Arch Math Logic, accepted) so as to be effective in any linearly ordered MV-algebra.

In this paper, we study multiplicative extensions of propositional many-place sequent calculi for finitely-valued logics arising from those introduced in Sect. 5 of Pynko (J Multiple-Valued Logic Soft Comput 10:339–362, 2004) through their translation by means of singularity determinants for logics and restriction of the original many-place sequent language. Our generalized approach, first of all, covers, on a uniform formal basis, both the one developed in Sect. 5 of Pynko (J Multiple-Valued Logic Soft Comput 10:339–362, 2004) for singular (...) finitely-valued logics (when singularity determinants consist of a variable alone) and conventional Gentzen-style (i.e., two-place sequent) calculi suggested in Pynko (Bull Sect Logic 33(1):23–32, 2004) for finitely-valued logics with equality determinant. In addition, it provides a universal method of constructing Tait-style (i.e., one-place sequent) calculi for finitely-valued logics with singularity determinant (in particular, for Łukasiewicz finitely-valued logics) that fits the well-known Tait calculus (Lecture Notes in Mathematics, Springer, Berlin, 1968) for the classical logic. We properly extend main results of Pynko (J Multiple-Valued Logic Soft Comput 10:339–362, 2004) and explore calculi under consideration within the framework of Sect. 7 of Pynko (Arch Math Logic 45:267–305, 2006), generalizing the results obtained in Sect. 7.5 of Pynko (Arch Math Logic 45:267–305 2006) for two-place sequent calculi associated with finitely-valued logics with equality determinant according to Pynko (Bull Sect Logic 33(1):23–32, 2004). We also exemplify our universal elaboration by applying it to some denumerable families of well-known finitely-valued logics. (shrink)

In Simmons (Arch Math Logic 43:65–83, 2004), I described a method of producing ordinal notations ‘from below’ (for countable ordinals up to the Howard ordinal) and compared that method with the current popular ‘from above’ method which uses a collapsing function from uncountable ordinals. This ‘from below’ method employs a slight generalization of the normal function—the fruitful functions—and what seems to be a new class of functions—the helpful functions—which exist at all levels of the function space hierarchy (...) over ordinals. Unfortunately, I was rather sparing in my description of these classes of functions. In this paper I am much more generous. I describe the properties of the helpful functions on all finite levels and, in the final section, indicate how they can be used to simplify the generation of ordinal notations. The main aim of this paper is to fill in the details missing from [7]. The secondary aim is to indicate what can be done with helpful functions. Fuller details of this development will appear elsewhere. (shrink)

In the context of a weak formal theory called Basic Intuitionistic Mathematics $$\textsf{BIM}$$ BIM, we study Brouwer’s Fan Theorem and a strong negation of the Fan Theorem, Kleene’s Alternative (to the Fan Theorem). We prove that the Fan Theorem is equivalent to contrapositions of a number of intuitionistically accepted axioms of countable choice and that Kleene’s Alternative is equivalent to strong negations of these statements. We discuss finite and infinite games and introduce a constructively useful notion of determinacy. We prove (...) that the Fan Theorem is equivalent to the Intuitionistic Determinacy Theorem. This theorem says that every subset of Cantor space $$2^\omega $$ 2 ω is, in our constructively meaningful sense, determinate. Kleene’s Alternative is equivalent to a strong negation of a special case of this theorem. We also consider a uniform intermediate value theorem and a compactness theorem for classical propositional logic. The Fan Theorem is equivalent to each of these theorems and Kleene’s Alternative is equivalent to strong negations of them. We end with a note on ‘stronger’ Fan Theorems. The paper is a sequel to Veldman (Arch Math Logic 53:621–693, 2014). (shrink)

We investigate several ideal versions of the pseudointersection number \(\mathfrak {p}\), ideal slalom numbers, and associated topological spaces with the focus on selection principles. However, it turns out that well-known pseudointersection invariant \(\mathtt {cov}^*({\mathcal I})\) has a crucial influence on the studied notions. For an invariant \(\mathfrak {p}_\mathrm {K}({\mathcal J})\) introduced by Borodulin-Nadzieja and Farkas (Arch. Math. Logic 51:187–202, 2012), and an invariant \(\mathfrak {p}_\mathrm {K}({\mathcal I},{\mathcal J})\) introduced by Repický (Real Anal. Exchange 46:367–394, 2021), we have (...) $$\begin{aligned} \min \{\mathfrak {p}_\mathrm {K}({\mathcal I}),\mathtt {cov}^*({\mathcal I})\}=\mathfrak {p},\qquad \min \{\mathfrak {p}_\mathrm {K}({\mathcal I},{\mathcal J}),\mathtt {cov}^*({\mathcal J})\}\le \mathtt {cov}^*({\mathcal I}), \end{aligned}$$ respectively. In addition to the first inequality, for a slalom invariant \(\mathfrak {sl_e}({\mathcal I},{\mathcal J})\) introduced in Šupina (J. Math. Anal. Appl. 434:477–491, 2016), we show that $$\begin{aligned} \min \{\mathfrak {p}_\mathrm {K}({\mathcal I}),\mathfrak {sl_e}({\mathcal I},{\mathcal J}),\mathtt {cov}^*({\mathcal J})\}=\mathfrak {p}. \end{aligned}$$ Finally, we obtain a consistency that ideal versions of the Fréchet–Urysohn property and the strictly Fréchet–Urysohn property are distinguished. (shrink)

Our work is a contribution to the model theory of fuzzy predicate logics. In this paper we characterize elementary equivalence between models of fuzzy predicate logic using elementary mappings. Refining the method of diagrams we give a solution to an open problem of Hájek and Cintula (J Symb Log 71(3):863–880, 2006, Conjectures 1 and 2). We investigate also the properties of elementary extensions in witnessed and quasi-witnessed theories, generalizing some results of Section 7 of Hájek and Cintula (J Symb (...) Log 71(3):863–880, 2006) and of Section 4 of Cerami and Esteva (Arch Math Log 50(5/6):625–641, 2011) to non-exhaustive models. (shrink)

There exists a countable structure of Scott rank where and where the -theory of is not ω-categorical. The Scott rank of a model is the least ordinal β where the model is prime in its -theory. Most well-known models with unbounded atoms below also realize a non-principal -type; such a model that preserves the Σ1-admissibility of will have Scott rank . Makkai [M. Makkai, An example concerning Scott heights, J. Symbolic Logic 46 301–318. [4]] produces a hyperarithmetical model of (...) Scott rank whose -theory is ω-categorical. A computable variant of Makkai’s example is produced in [W. Calvert, S.S. Goncharov, J.F. Knight, J. Millar, Categoricity of computable infinitary theories, Arch. Math. Logic . [1]; J. Knight, J. Millar, Computable structures of rank J. Math. Logic . [2]]. (shrink)

$$\mathbf {Z}$$ is a new type of non-finitist inference, i.e., an inference that involves treating some infinite collection as completed, designed for contraction free logic with unrestricted abstraction. It has been introduced in Petersen (Studia Logica 64:365–403, 2000) and shown to be consistent within a system $$\mathbf {{}L^iD{}}{}$$ $$_{\uplambda }$$ of contraction free logic with unrestricted abstraction. In Petersen (Arch Math Log 42(7):665–694, 2003) it was established that adding $$ \mathbf {Z}$$ to $$\mathbf {{}L^iD{}}{}$$ $$_{\uplambda }$$ (...) is sufficient to prove the totality of primitive recursive functions but it was also indicated that this would not extend to 2-recursive functions such as the Ackermann–Péter function, for instance. The purpose of the present paper is to expand the underlying idea in the construction of $$\mathbf {Z}$$ to gain a stronger notion, conveniently labeled $$\mathbf {Z}_2$$, which is sufficient to prove a form of nested double induction and thereby the totality of 2-recursive functions. (shrink)

We show it is consistent that there is a Souslin tree S such that after forcing with S, S is Kurepa and for all clubs $$C \subset \omega _1$$ C ⊂ ω 1, $$S\upharpoonright C$$ S ↾ C is rigid. This answers the questions in Fuchs (Arch Math Logic 52(1–2):47–66, 2013). Moreover, we show it is consistent with $$\diamondsuit $$ ♢ that for every Souslin tree T there is a dense $$X \subseteq T$$ X ⊆ T which (...) does not contain a copy of T. This is related to a question due to Baumgartner in Baumgartner (Ordered sets (Banff, Alta., 1981), volume 83 of NATO Adv. Study Inst. Ser. C: Math. Phys. Sci., Reidel, Dordrecht-Boston, pp 239–277, 1982). (shrink)

We study the Lindenbaum algebra ${\fancyscript{A}}$ (WKL o, RCA o) of sentences in the language of second-order arithmetic that imply RCA o and are provable from WKL o. We explore the relationship between ${\Sigma^1_1}$ sentences in ${\fancyscript{A}}$ (WKL o, RCA o) and ${\Pi^0_1}$ classes of subsets of ω. By applying a result of Binns and Simpson (Arch. Math. Logic 43(3), 399–414, 2004) about ${\Pi^0_1}$ classes, we give a specific embedding of the free distributive lattice with countably many (...) generators into ${\fancyscript{A}}$ (WKL o, RCA o). (shrink)

In set theory without the Axiom of Choice we prove that the assertion “For every metric space (_X_, _d_) with a Borel measure \(\mu \) such that the measure of every open ball is positive and finite, (_X_, _d_) is separable.’ is implied by the axiom of choice for countable collections of sets and implies the axiom of choice for countable collections of finite sets. We also show that neither implication is reversible in Zermelo–Fraenkel set theory weakend to permit the (...) existence of atoms and that the second implication is not reversible in Zermelo–Fraenkel set theory. This gives an answer to a question of Dybowski and Górka (Arch Math Logic 62:735–749, 2023. https://doi.org/10.1007/s00153-023-00868-4 ). (shrink)

Lachlan observed that any nonzero d.c.e. degree bounds a nonzero c.e. degree. In this paper, we study the c.e. predecessors of d.c.e. degrees, and prove that given a nonzero d.c.e. degree , there is a c.e. degree below and a high d.c.e. degree such that bounds all the c.e. degrees below . This result gives a unified approach to some seemingly unrelated results. In particular, it has the following two known theorems as corollaries: there is a low c.e. degree isolating (...) a high d.c.e. degree [S. Ishmukhametov, G. Wu, Isolation and the high/low hierarchy, Arch. Math. Logic 41 259–266]; there is a high d.c.e. degree bounding no minimal pairs [C.T. Chong, A. Li, Y. Yang, The existence of high nonbounding degrees in the difference hierarchy, Ann. Pure Appl. Logic 138 31–51]. (shrink)

In our former works, for a given concept of reduction, we study the following hypothesis: “For a random oracle A, with probability one, the degree of the one-query tautologies with respect to A is strictly higher than the degree of A.” In our former works (Suzuki in Kobe J. Math. 15, 91–102, 1998; in Inf. Comput. 176, 66–87, 2002; in Arch. Math. Logic 44, 751–762), the following three results are shown: The hypothesis for p-T (polynomial-time Turing) (...) reduction is equivalent to the assertion that the probabilistic complexity class R is not equal to NP; The hypothesis for p-tt (polynomial-time truth-table) reduction implies that P is not NP; The hypothesis holds for each of the following: disjunctive reduction, conjunctive reduction, and p-btt (polynomial-time bounded-truth-table) reduction. In this paper, we show the following three results: (1) Let c be a positive real number. We consider a concept of truth-table reduction whose norm is at most c times size of input, where for a relativized propositional formula F, the size of F denotes the total number of occurrences of propositional variables, constants and propositional connectives. Then, our main result is that the hypothesis holds for such tt-reduction, provided that c is small enough. How small c can we take so that the above holds? It depends on our syntactic convention on one-query tautologies. In our setting, the statement holds for all c < 1. (2) The hypothesis holds for monotone truth-table reduction (also called positive reduction). (3) Dowd (in Inf. Comput. 96, 65–76, 1992) shows a polynomial upper bound for the minimum sizes of forcing conditions associated with a random oracle. We apply the above result (1), and get a linear lower bound for the sizes. (shrink)

The main purpose of this dissertation is to apply and develop new forcing techniques to obtain models where several cardinal characteristics are pairwise different as well as force many (even more, continuum many) different values of cardinal characteristics that are parametrized by reals. In particular, we look at cardinal characteristics associated with strong measure zero, Yorioka ideals, and localization and anti-localization cardinals.In this thesis we introduce the property “F-linked” of subsets of posets for a given free filter F on the (...) natural numbers, and define the properties “ $\mu $ -F-linked” and “ $\theta $ -F-Knaster” for posets in a natural way. We show that $\theta $ -F-Knaster posets preserve strong types of unbounded families and of maximal almost disjoint families. These kinds of posets led to the development of a general technique to construct $\theta $ - $\textrm {Fr}$ -Knaster posets (where $\textrm {Fr}$ is the Frechet ideal) via matrix iterations of ${<}\theta $ -ultrafilter-linked posets (restricted to some level of the matrix). The latter technique allows proving consistency results about Cichoń’s diagram (without using large cardinals) and to prove the consistency of the fact that, for each Yorioka ideal, the four cardinal characteristics associated with it are pairwise different. Another important application is to show that three strongly compact cardinals are enough to force that Cichoń’s diagram can be separated into 10 different values. Later on, it was shown by Goldstern, Kellner, Mejía, and Shelah that no large cardinals are needed for Cichoń’s maximum (J. Eur. Math. Soc. 24 (2022), no. 11, p. 3951–3967).On the other hand, we deal with certain types of tree forcings including Sacks forcing, and show that these increase the covering of the strong measure zero ideal $\mathcal {SN}$. As a consequence, in Sacks model, such covering number is equal to the size of the continuum, which indicates that this covering number is consistently larger than any other classical cardinal characteristics of the continuum. Even more, Sacks forcing can be used to force that $\operatorname {\mathrm{non}}(\mathcal {SN})<\operatorname {\mathrm{cov}}(\mathcal {SN})<\operatorname {\mathrm{cof}}(\mathcal {SN})$, which is the first consistency result where more than two cardinal characteristics associated with $\mathcal {SN}$ are pairwise different. To obtain another result in this direction, we provide bounds for $\operatorname {\mathrm{cof}}(\mathcal {SN})$, which generalizes Yorioka’s characterization of $\mathcal {SN}$ (J. Symbolic Logic 67.4 (2002), p. 1373–1384). As a consequence, we get the consistency of $\operatorname {\mathrm{add}}(\mathcal {SN})=\operatorname {\mathrm{cov}}(\mathcal {SN})<\operatorname {\mathrm{non}}(\mathcal {SN})<\operatorname {\mathrm{cof}}(\mathcal {SN})$ with ZFC (via a matrix iteration forcing construction).We conclude this thesis by combining creature forcing approaches by Kellner and Shelah (Arch. Math. Logic 51.1–2 (2012), p. 49–70) and by Fischer, Goldstern, Kellner, and Shelah (Arch. Math. Logic 56.7–8 (2017), p. 1045–1103) to show that, under CH, there is a proper $\omega ^\omega $ -bounding poset with $\aleph _2$ -cc that forces continuum many pairwise different cardinal characteristics, parametrized by reals, for each one of the following six types: uniformity and covering numbers of Yorioka ideals as well as both kinds of localization and anti-localization cardinals, respectively. This answers several open questions from Klausner and Mejía (Arch. Math. Logic 61 (2022), pp. 653–683).Abstract prepared by Miguel Antonio Cardona-MontoyaE-mail: [email protected]: https://repositum.tuwien.at/handle/20.500.12708/19629. (shrink)

G. Jäger gave in Arch. Math. Logik Grundlagenforsch. 24 , 49-62, a recursive notation system on a basis of a hierarchy Iαß of α-inaccessible regular ordinals using collapsing functions following W. Buchholz in Ann. Pure Appl. Logic 32 , 195-207. Jäger's system stops, when ordinals α with Iα0 = α enter. This border is now overcome by introducing additional a hierarchy Jαß of weakly inaccessible Mahlo numbers, which is defined similarly to the Jäger hierarchy. An ordinal μ (...) is called Mahlo, if every normal-function f : μ → μ has regular fixpoints. Collapsing is defined for both Mahlo and simply regular ordinals such that for every Mahlo ordinal μ out of the J-hierarchy Ψμα is a regular σ such that Iσ0 = σ. For these regular σ again collapsing functions Ψσ are defined. To get a proper systematical order into the collapsing procedure, a pair of ordinals is associated to σ and α, and the definition of Ψσα is given by recursion on a suitable well-ordering of these pairs. Thus a fairly large system of ordinal notations can be established. It seems rather straightforward, how to extend this setting further. (shrink)

The program of Reverse Mathematics (Simpson 2009) has provided us with the insight that most theorems of ordinary mathematics are either equivalent to one of a select few logical principles, or provable in a weak base theory. In this paper, we study the properties of the Dirac delta function (Dirac 1927; Schwartz 1951) in two settings of Reverse Mathematics. In particular, we consider the Dirac Delta Theorem, which formalizes the well-known property \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} (...) \begin{document}$${\int_\mathbb{R}f(x)\delta(x)\,dx=f(0)}$$\end{document} of the Dirac delta function. We show that the Dirac Delta Theorem is equivalent to weak König’s Lemma (see Yu and Simpson in Arch Math Log 30(3):171–180, 1990) in classical Reverse Mathematics. This further validates the status of WWKL0 as one of the ‘Big’ systems of Reverse Mathematics. In the context of ERNA’s Reverse Mathematics (Sanders in J Symb Log 76(2):637–664, 2011), we show that the Dirac Delta Theorem is equivalent to the Universal Transfer Principle. Since the Universal Transfer Principle corresponds to WKL, it seems that, in ERNA’s Reverse Mathematics, the principles corresponding to WKL and WWKL coincide. Hence, ERNA’s Reverse Mathematics is actually coarser than classical Reverse Mathematics, although the base theory has lower first-order strength. (shrink)

For \(n\in \omega \), the weak choice principle \(\textrm{RC}_n\) is defined as follows: _For every infinite set_ _X_ _there is an infinite subset_ \(Y\subseteq X\) _with a choice function on_ \([Y]^n:=\{z\subseteq Y:|z|=n\}\). The choice principle \(\textrm{C}_n^-\) states the following: _For every infinite family of_ _n_-_element sets, there is an infinite subfamily_ \({\mathcal {G}}\subseteq {\mathcal {F}}\) _with a choice function._ The choice principles \(\textrm{LOC}_n^-\) and \(\textrm{WOC}_n^-\) are the same as \(\textrm{C}_n^-\), but we assume that the family \({\mathcal {F}}\) is linearly orderable (...) (for \(\textrm{LOC}_n^-\) ) or well-orderable (for \(\textrm{WOC}_n^-\) ). In the first part of this paper, for \(m,n\in \omega \) we will give a full characterization of when the implication \(\textrm{RC}_m\Rightarrow \textrm{WOC}_n^-\) holds in \({\textsf {ZF}}\). We will prove the independence results by using suitable Fraenkel-Mostowski permutation models. In the second part, we will show some generalizations. In particular, we will show that \(\textrm{RC}_5\Rightarrow \textrm{LOC}_5^-\) and that \(\textrm{RC}_6\Rightarrow \textrm{C}_3^-\), answering two open questions from Halbeisen and Tachtsis (Arch Math Logik 59(5):583–606, 2020). Furthermore, we will show that \(\textrm{RC}_6\Rightarrow \textrm{C}_9^-\) and that \(\textrm{RC}_7\Rightarrow \textrm{LOC}_7^-\). (shrink)

Long ago, when Alexander the Great asked the mathematician Menaechmus for a crash course in geometry, he got the famous reply ``There is no royal road to mathematics.'' Where there was no shortcut for Alexander, there is no shortcut for us. Still, the fact that we have access to computers and mature programming languages means that there are avenues for us that were denied to the kings and emperors of yore. The purpose of this book is to teach logic (...) and mathematical reasoning in practice, and to connect logical reasoning with computer programming in Haskell. Haskell emerged in the 1990s as a standard for lazy functional programming, a programming style where arguments are evaluated only when the value is actually needed. Haskell is a marvelous demonstration tool for logic and maths because its functional character allows implementations to remain very close to the concepts that get implemented, while the laziness permits smooth handling of infinite data structures. This book does not assume the reader to have previous experience with either programming or construction of formal proofs, but acquaintance with mathematical notation, at the level of secondary school mathematics is presumed. Everything one needs to know about mathematical reasoning or programming is explained as we go along. After proper digestion of the material in this book, the reader will be able to write interesting programs, reason about their correctness, and document them in a clear fashion. The reader will also have learned how to set up mathematical proofs in a structured way, and how to read and digest mathematical proofs written by others. This is the updated, expanded, and corrected second edition of a much-acclaimed textbook. Praise for the first edition: 'Doets and van Eijck's ``The Haskell Road to Logic, Maths and Programming'' is an astonishingly extensive and accessible textbook on logic, maths, and Haskell.' Ralf Laemmel, Professor of Computer Science, University of Koblenz-Landau. (shrink)

Seventy-five fun puzzles to help improve mathematical and thinking skills. Decipher various clues by adding, subtracting, multiplying, dividing, reading carefully, and using powers of reason. Transfer the information onto grids that are provided, and find the solution to a given set of circumstances. "...the book is a delightful collection of problem situations that teachers and students will enjoy using..."--Mathematics.

This book offers a unique analysis of how ideas about science and technology in the public and scientific imaginations (in particular about maths, logic, the gene, the brain, god, and robots) perpetuate the false reality that values and politics are separate from scientific knowledge and its applications. These ideas are reinforced by cultural myths about free will and individualism. Restivo makes a compelling case for a synchronistic approach in the study of these notoriously 'hard' cases, arguing that their significance (...) reaches far beyond the realms of science and technology, and that their sociological and political ramifications are of paramount importance in our global society. This innovative work deals with perennial problems in the social sciences, philosophy, and the history of science and religion, and will be of special interest to professionals in these fields, as well as scholars of science and technology studies. (shrink)

Numbers. Natural numbers -- Integers -- Real numbers -- Irrational and transcendental numbers -- Funny numbers. Zero -- e : the unnatural natural number -- [Phi] : the golden ratio -- i : the imaginary number -- Writing numbers. Roman numerals -- Egyptian fractions -- Continued fractions -- Logic. Mr. Spock is not logical -- Proofs, truth, and trees : oh my! -- Programming with logic -- Temporal reasoning -- Sets. Cantor's diagonalization : infinity isn't just infinity -- (...) Axiomatic set theory : keep the good, dump the bad -- Models : using sets as the LEGOs of the math world -- Transfinite numbers : counting and ordering infinite sets -- Group theory : finding symmetries with sets -- Mechanical math. Finite state machines : simplicity goes far -- The turing machine -- Pathology and the heart of computing -- Calculus : no, not that calculus- [lambda] calculus -- Numbers, booleans, and recursion -- Types, types, types : modeling [lambda] calculus -- The halting problem. (shrink)

The volume includes twenty-five research papers presented as gifts to John L. Bell to celebrate his 60th birthday by colleagues, former students, friends and admirers. Like Bell’s own work, the contributions cross boundaries into several inter-related fields. The contributions are new work by highly respected figures, several of whom are among the key figures in their fields. Some examples: in foundations of maths and logic ; analytical philosophy, philosophy of science, philosophy of mathematics and decision theory and foundations of (...) economics. Most articles are contributions to current philosophical debates, but contributions also include some new mathematical results, important historical surveys, and a translation by Wilfrid Hodges of a key work of arabic logic. (shrink)

Every university student has his or her nemesis. Biology and social science students anticipate with great apprehension their required statistics course, while many philosophy students live in fear of formal logic. Math anxiety is the common thread uniting all of them. This article argues that since formal logic is an algebra requiring similar kinds of symbol-manipulation skills needed to succeed in a basic mathematics course, then if logic students have math anxiety, this can impede their (...) progress. Further, it argues that math anxiety is primarily caused by and exacerbated by poor instruction. Formal logic instructors who employ effective instructional techniques for reducing it can help their students overcome math anxiety to foster learning. Methods of instruction leading to anxiety reduction and evidence supporting their efficacy are discussed, including co-operative learning, the mastery goal approach, and self-paced learning. None of these methods holds back more advanced students. (shrink)

This Oxford Handbook covers the current state of the art in the philosophy of maths and logic in a comprehensive and accessible manner, giving the reader an overview of the major problems, positions, and battle lines. The 26 newly-commissioned chapters are by established experts in the field and contain both exposition and criticism as well as substantial development of their own positions. Select major positions are represented by two chapters - one supportive and one critical. The book includes a (...) comprehensive bibliography. (shrink)

The present research investigates gender gaps in the results of secondary school exit exams in mathematics in Poland in 2015. The analysis shows that, in the basic level exam, males are highly overrepresented at the upper end of the score distribution. The same pattern did not exist in the extended-level Matura. Two explanations are offered here. The differences are driven by gender self-selection in high school programs. Students who decide on maths-related tracks have more maths lessons than other students. Secondly, (...) a student who takes the extended Matura also has to take the basic Matura exam. As a result, the population of students taking the basic Matura is highly differentiated in terms of maths competence and motivation. Additionally, the analysis of differential item functioning shows that only a few items were flagged as having DIF. (shrink)

In the paper “Math Anxiety,” Aden Evens explores the manner by means of which concepts are implicated in the problematic Idea according to the philosophy of Gilles Deleuze. The example that Evens draws from Difference and Repetition in order to demonstrate this relation is a mathematics problem, the elements of which are the differentials of the differential calculus. What I would like to offer in the present paper is an historical account of the mathematical problematic that Deleuze deploys in (...) his philosophy, and an introduction to the role that this problematic plays in the develop- ment of his philosophy of difference. One of the points of departure that I will take from the Evens paper is the theme of “power series.”2 This will involve a detailed elaboration of the mechanism by means of which power series operate in the differential calculus deployed by Deleuze in Difference and Repetition. Deleuze actually constructs an alternative history of mathematics that establishes an historical conti- nuity between the differential point of view of the infinitesimal calculus and modern theories of the differential calculus. It is in relation to the differential point of view of the infinitesimal calculus that Deleuze determines a differential logic which he deploys, in the form of a logic of different/ciation, in the development of his proj- ect of constructing a philosophy of difference. (shrink)

Many authors, including Oswaldo Chateaubriand, maintain that “properties” should be structured in logical grades, where the least abstract quantities comprise the lowest ranks of a hierarchy that embraces more abstract and mathematized qualities only at higher levels. But applied mathematicians warns that no quantities can be expected to possess crisp, real world extensions unless they have already been processed with a fair amount of set theoretic machinery beforehand.Muitos autores, incluindo Oswaldo Chateaubriand, sustentam que "propriedades" deveriam ser estruturadas em uma gradação (...) lógica, onde as quantidades menos abstratas ficariam num nível mais baixo de uma hierarquia que abarca qualidades mais matematizadas e abstratas somente em níveis mais elevados. Mas matemáticos aplicados advertem que não se pode esperar de nenhuma quantidade que elas possuam extensões precisas, como do mundo real, a menos que já tenham sido tratados de antemão com uma boa dose de maquinaria conjuntista. (shrink)

The purpose of this paper is to show that the mathematics of quantum mechanics is the mathematics of set partitions linearized to vector spaces, particularly in Hilbert spaces. That is, the math of QM is the Hilbert space version of the math to describe objective indefiniteness that at the set level is the math of partitions. The key analytical concepts are definiteness versus indefiniteness, distinctions versus indistinctions, and distinguishability versus indistinguishability. The key machinery to go from indefinite (...) to more definite states is the partition join operation at the set level that prefigures at the quantum level projective measurement as well as the formation of maximally-definite state descriptions by Dirac’s Complete Sets of Commuting Operators. This development is measured quantitatively by logical entropy at the set level and by quantum logical entropy at the quantum level. This follow-the-math approach supports the Literal Interpretation of QM—as advocated by Abner Shimony among others which sees a reality of objective indefiniteness that is quite different from the common sense and classical view of reality as being “definite all the way down”. (shrink)

El presente artículo explora los retos políticos que plantea la democracia directa. En el pensamiento político de Locke la democracia representativa consiste en el compromiso de mantener la estructura económica de laisser-faire, mientras que la democracia directa rousseauniana que demanda homogeneidad acaba por no ser muy democrática. La cuestión en juego es si puede haber un régimen político capaz de acoger tanto una participación inclusiva como la diversidad existente de los participantes. Se presentan dos respuestas diferentes a esta pregunta a (...) través de las obras de Jean-Luc Nancy y Jacques Rancière. (shrink)

Euclid in the Rainforest combines the literary with the mathematical to explore logic--the one indispensable tool in man's quest to understand the world. Mazur argues that logical reasoning is not purely robotic. At its most basic level, it is a creative process guided by our intuitions and beliefs about the world.

Explore how mathematics has shaped how we look at and understand the world. From figuring out Earth's circumference using geometry to developing load-bearing arches, young readers will be engaged as they learn about real world math applications.

Where does math come from? From a textbook? From rules? From deduction? From logic? Not really, Eugenia Cheng writes in Is Math Real?: it comes from curiosity, from instinctive human curiosity, "from people not being satisfied with answers and always wanting to understand more." And most importantly, she says, "it comes from questions": not from answering them, but from posing them. Nothing could seem more at odds from the way most of us were taught math: a (...) rigid and autocratic model which taught us to follow specific steps to reach specific answers. Instead of encouraging a child who asks why 1+1 is 2, our methods of education force them to accept it. Instead of exploring why we multiply before we add, a textbook says, just to get on with the order of operations. Indeed, the point is usually just about getting the right answer, and those that are good at that, become "good at math" while those who question, are not. And that's terrible: These very same questions, as Cheng shows, aren't simply annoying questions coming from people who just don't "get it" and so can't do math. Rather, they are what drives mathematical research and push the boundaries in our understanding of all things. Legitimizing those questions, she invites everyone in, whether they think they are good at math or not. And by highlighting the development of mathematics outside Europe, Cheng shows that-western chauvinism notwithstanding--that math can be for anyone who wishes to do it, and how much we gain when anyone can. (shrink)

In Winter 2017, the first author piloted a course in formal logic in which we aimed to (a) improve student engagement and mastery of the content, and (b) reduce maths anxiety and its negative effects on student outcomes, by adopting student oriented teaching including peer instruction and classroom flipping techniques. The course implemented a partially flipped approach, and incorporated group-work and peer learning elements, while retaining some of the traditional lecture format. By doing this, a wide variety of student (...) learning preferences could be provided for. (shrink)

Mathematics, even more than the other sciences, is often presented as essentially unique, as if it could not be any other way. And yet, prima facie alternative mathematics are all over the place, from non-Western mathematics to mathematics based on nonclassical logics. Taking inspiration from Robin Dembroff’s analysis of critical gender kinds, and from Andrew Aberdein and Stephen Read’s analysis of alternative logics, in this paper I will introduce a practice-centered framework for the study of alternative mathematics based on the (...) notion of critical math kind. After sketching a model of mainstream mathematics, I will provide examples of how deviation along several distinct dimensions can occur, and how deviations can vary in their gravity. I will then discuss how the framework can be used to think of questions concerning the alternativeness status and philosophical implications of alleged alternative mathematics, and help us in identifying alternatives that suit our purposes. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Math Anxiety:Making Room to BreatheValerie Allen (bio) and Todd Stambaugh (bio)"Don't do that to me, Professor," the student said, and everybody laughed, for by this late in the semester, the atmosphere was relaxed. The instructor in question had just reached the point in a worked problem when they could move from reasoning about specific numbers to stating a general principle: x≤y≤z, meaning that y—the value we sought—was always (...) going to be greater than or equal to one value (x) and less than or equal to the other (z). The student who had spoken had earned everyone's affection over the weeks, open about their difficulties with math, ready to risk being wrong, and to ask obvious questions that others may have been reluctant to owning. They had hung in there, despite presenting a classic case of math anxiety, a syndrome long recognized in the scholarship of teaching and learning.Among math anxiety's many symptoms, breathing disruption ranks high: hyperventilation (rapid breathing) and hypoventilation (barely or not breathing). When the energy-conserving parasympathetic nervous system is overtaken by the energy-expending sympathetic nervous system, the long exhalations that decelerate the heart rate are replaced by short, panting puffs from the upper lungs. The timed test provides the perfect environment for math anxiety to flourish. Stress diverts cognitive resources needed for procedural execution, so working memory consequently shrinks.Self-rated metrics for math anxiety have been in place for decades (Richardson and Suinn). Relatively trivial interventions can yield nontrivial results: deep breathing exercises and positive affirmations have a beneficial impact, as does writing about one's nerves immediately prior to an exam (Brunyé et al.). More systemic changes require a reorientation in teaching whereby conceptual mistakes are positively rewarded as opportunities for learning; students compose questions instead of answers; students solve problems together rather than perform solo (Boaler).Return now to that opening scenario to watch it become stereotype incarnate: the student was mature, Black, and female; the teacher, younger, white, and male; her comment was triggered by his shift from a specific [End Page 217] set of numbers into symbolic notation. There is robust evidence to demonstrate that certain demographics are consistently underrepresented in the U.S. math community: women and "African-Americans, Hispanics, American Indians, Alaska Natives, and Pacific Islanders," according to the Mathematical Association of America (MAA) ("Resources for Minority"). Routinely feeling that they do not belong, such groups are particularly vulnerable to math anxiety.Several remedies for such disparity suggest themselves: appointing more women and people of color in the profession; one-on-one tutorial assistance; research projects about the students' personal environment; privileging pre-test, low-stakes work over timed tests; assigning group rather than individual work. When all is said and done, however, such strategies "have little to do with mathematics content" (Martin 304). Mathematicians still need to be able to conceptualize, describe, and manipulate abstract objects, and there seems to be a suspicion that, at heart, abstraction is gendered masculine and colored white.It is possible that the rhetorical immediacy and context-dependence of Black English has misguidedly reinforced such a perception. For poet June Jordan, Black English "devolves from a culture that abhors all abstraction" (Jordan 367). Psychiatrist Alvin Poussaint asks, "Is there a way to say metamorphosis in Ebonics?" (O'Malley). Yet, despite Black English's avoidance of nominalization and similar verbosities that afflict academic prose, abstract logical reasoning flourishes in vernacular idiom, as linguist William Labov demonstrated half a century ago. Our aim is not to explain the asymptote in Black English but rather to consider a feature characteristic of those very minority cultures historically underrepresented in math—storytelling—and to ask how it may be foregrounded in mathematics, where it is decisively sidelined. Storytelling has been claimed by every culture and ethnic group at some point as the repository of wisdom, practical skills, religious beliefs, and shared identity and values; but when it gets corralled into the category of "fiction," and when it gets opposed to "fact," a narrowed concept of truth dispatches storytelling to kindergarten and recreational math. Word problems may supply scenarios but offer none of a plot's satisfactions... (shrink)

Journal of Mathematical Logic, Volume 22, Issue 02, August 2022. We generically construct a model in which the [math]-separation property is true, i.e. every pair of disjoint [math]-sets can be separated by a [math]-definable set. This answers an old question from the problem list “Surrealist landscape with figures” by A. Mathias from 1968. We also construct a model in which the (lightface) [math]-separation property is true.

In this article we are offering a method of analysis and formalization of the Epicurean objection to the Skeptics from the Adversus mathematicos VIII, 337, 6-9. We emphasize the importance of this objection for understanding Sextus Empiricus’ response to it, continuously discussed by the historians of philosophy. The Epicureans argue that the Skeptics cannot criticize their proof, because when the Skeptics are criticizing their proof, they think something different from the original proof, so that the original proof remains untouchable by (...) any criticism. We explain in which sense the holistic assumption used by Sextus Empiricus and some philosophers before him can be used in the Epicurean objection to the Skeptics. In the final formalization we show that Epicureans’ argument can be interpreted as logically correct and deduced from sound premises. In the course of arguing for this thesis we are using the technical means of contemporary epistemic logic. (shrink)

_More Precisely_ provides a rigorous and engaging introduction to the mathematics necessary to do philosophy. It is impossible to fully understand much of the most important work in contemporary philosophy without a basic grasp of set theory, functions, probability, modality and infinity. Until now, this knowledge was difficult to acquire. Professors had to provide custom handouts to their classes, while students struggled through math texts searching for insight. _More Precisely_ fills this key gap. Eric Steinhart provides lucid explanations of (...) the basic mathematical concepts and sets out most commonly used notational conventions. Furthermore, he demonstrates how mathematics applies to many fundamental issues in branches of philosophy such as metaphysics, philosophy of language, epistemology, and ethics. (shrink)

We compare Carnap's and Kuhn's views on science. Although there are important differences between them, the similarities are striking. The basis for the latter is a pragmatically oriented semantic conventionalist picture of science, which suggests that the view that post-positivist philosophy of science constitutes a radical revolution which has no interesting affinities with logical positivism must be seriously mistaken.

The term “Presocratics” refers to a group of Greek thinkers who lived not later than Socrates and who were not decisively influenced by him. They are often referred to as the first philosophers as they represent the dawn of human speculation in the West. The essay examines the fragments of major Presocratics - Thales, Anaximander, Anaximenes, Heraclitus, Pythagoras, Parmenides, Empidocles and Anaxagoras, which contain their views and arguments as reported by subsequent authors. Although these fragments are incomplete and are based (...) on secondary quotations, it is possible to sift through them and develop coherent and logical interpretations that approximate the original idea and intentions of these philosophers. The aim of this essay is to shed light on the philosophical meaning and significance of the concept of Arche (ἀρχή) – an untranslatable Greek word that connotes origin, principle, first in the series, or source, which constitutes the central thread of speculation among the Presocratics and their most influential contribution to the history of Western thought. (shrink)